Clopen realcompactification of a mapping

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clopen Graphs

A graph G on a topological space X as its set of vertices is clopen if the edge relation of G is a clopen subset of X2 without the diagonal. We study clopen graphs on Polish spaces in terms of their finite induced subgraphs and obtain information about their cochromatic numbers. In this context we investigate modular profinite graphs, a class of graphs obtained from finite graphs by taking inve...

متن کامل

Realcompactification of frames

for each a ∈ A. We denote the top and bottom elements of a σ-frame A respectively by 1A and 0A. σ-Frame homomorphisms preserve countable joins and finite meets. The resulting category is denoted σFrm. Extending the above notions by allowing arbitrary subsets and arbitrary joins in the definitions leads to the notions of a frame and a frame homomorphism, and the corresponding category Frm of fra...

متن کامل

Clopen Knowledge Bases

We propose Clopen Knowledge Bases (CKBs) as a new formalism combining Answer Set Programming (ASP) with ontology languages based on first-order logic. CKBs generalize the prominent r-hybrid and DL+LOG languages of Rosati, and are more flexible for specification of problems that combine open-world and closed-world reasoning. We argue that the guarded negation fragment of first-order logic (GNFO)...

متن کامل

Hemirings, Congruences and the Hewitt Realcompactification

The present paper indicate a method of obtaining the Hewitt realcompactification vX of a Tychonoff space X, by considering a distinguished family of maximal regular congruences, viz., those which are real, on the hemiring C+(X) of all the non-negative real valued continuous functions on X.

متن کامل

A hierarchy of clopen graphs on the Baire space

We say that E ⊆ X × X is a clopen graph on X iff E is symmetric and irreflexive and clopen relative to X\∆ where ∆ = {(x, x) : x ∈ X} is the diagonal. Equivalently E ⊆ [X] and for all x 6= y ∈ X there are open neighborhoods x ∈ U and y ∈ V such that either U × V ⊆ E or U × V ⊆ X\E. For clopen graphs E1, E2 on spaces X1, X2, we say that E1 continuously reduces to E2 iff there is a continuous map...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1985

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1985.119.153